Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler

A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit exception handler of backward recovery. Mutual exclusion is fundamental in the area of distributed computing, by serializing the accesses to a common shared resource. All existing probabilistic self-stabilizing mutual exclusion algorithms designed to work under an unfair distributed scheduler suffer from the followingcommon drawback: Once stabilized, there exists no upper bound of time between two executions of the critical section at a given node. We present the first probabilistic self-stabilizing algorithm that guarantees such a bound (O(n), where n is the network size) while working using an unfair distributed scheduler. As the scheduling adversary gets weaker, the bound gets better. Our algorithm works in an anonymous unidirectional ring of any size and has a O(n) expected stabilization time. Due to space restiction, proofs are omitted from this extended abstract and can be found in [6].